Linear Hull

См. также в других словарях:

• Linear span — In the mathematical subfield of linear algebra, the linear span, also called the linear hull, of a set of vectors in a vector space is the intersection of all subspaces containing that set. The linear span of a set of vectors is therefore a… …   Wikipedia

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… …   Wikipedia

• Hull-Zelle — Skizze einer Hull Zelle. Eine Hull Zelle ist eine standardisierte, auf Labormaßstab verkleinerte Galvanisieranlage (benannt nach R. O. Hull). Sie besteht aus einem trapezförmigen Behälter aus nichtleitendem Material, in dem die Elektroden so… …   Deutsch Wikipedia

• Convex hull — The convex hull of the red set is the blue convex set. See also: Convex set and Convex combination In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the min …   Wikipedia

• Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… …   Wikipedia

• Dynamic convex hull — The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track, of the convex hull for the dynamically changing input data, i.e., when input data elements may …   Wikipedia

• Affine hull — In mathematics, the affine hull of a set S in Euclidean space R n is the smallest affine set containing S , or equivalently, the intersection of all affine sets containing S . Here, an affine set may be defined as the translation of a vector… …   Wikipedia

• Л — Лаг [lag, time lag], временной Л., запаздывание Лагранжа метод  [Lagrangian method] Лагранжиан (функция Лагранжа) [Lagrangian] Ласпейреса …   Экономико-математический словарь

• Мёрфи, Шон (криптограф) — В Википедии есть статьи о других людях с такой фамилией, см. Мёрфи. Шон Мерфи (англ. Sean Murphy)  английский криптограф, в настоящее время профессор Лондонского университета (колледж Royal Holloway). Содержание 1 Научная деятельность …   Википедия

• Multiresolution analysis — A multiresolution analysis (MRA) or multiscale approximation (MSA) is the design method of most of the practically relevant discrete wavelet transforms (DWT) and the justification for the algorithm of the fast wavelet transform (FWT). It was… …   Wikipedia